The (conditional) matching preclusion for burnt pancake graphs
نویسندگان
چکیده
منابع مشابه
Strong matching preclusion of burnt pancake graphs
The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. This is an extension of the matching preclusion problem that was introduced by Park and Ihm. The burnt pancake graph is a more complex variant of the pancake graph. In this talk, we examine the properties ...
متن کاملConditional Matching Preclusion Number of Certain Graphs
The matching preclusion number of a graph is the minimum number of neither edges whose deletion in a graph has a neither perfect matching nor an almost perfect matching. For many interconnection networks, the optimal sets are precisely those induced by a single vertex. Recently the conditional matching preclusion number of a graph was introduced to look for sets beyond those induced by a single...
متن کاملMatching preclusion and Conditional Matching preclusion for Crossed Cubes
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. For many interconnection networks, the optimal sets are precisely those induced by a single vertex. Recently, the conditional matching preclusion number of a graph was introduced to look for obstruction sets beyond those inci...
متن کاملFault-tolerant routing in burnt pancake graphs
Recently, researches of parallel distributed computation are getting more important. Especially, massively parallel systems are studied with enthusiasm, and many topologies have been proposed. Since multiple faulty elements are expected in a massively parallel system, fault-tolerant routing is also studied eagerly for communication avoiding the faulty elements [4,6,8]. In this study, we focus o...
متن کاملMatching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-stars
The matching preclusion number of a graph with an even number of vertices is the minimum number of edges whose deletion results in a graph that has no perfect matchings. For many interconnection networks, the optimal sets are precisely those induced by a single vertex. It is natural to look for obstruction sets beyond those induced by a single vertex. The conditional matching preclusion number ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2013
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.01.010